Parallel Processing Letters Revisiting the Decomposition of Karp, Miller and Winograd
نویسنده
چکیده
This paper is devoted to the construction of multi-dimensional schedules for a system of uniform recurrence equations. We show that this problem is dual to the problem of computability of a system of uniform recurrence equations. We propose a new study of the decomposition algorithm rst proposed by Karp, Miller and Winograd: we base our implementation on linear programming resolutions whose duals give exactly the desired multi-dimensional schedules. Furthermore, we prove that the schedules built this way are optimal up to a constant factor.
منابع مشابه
Revisiting the Decomposition of Karp, Miller and Winograd
This paper is devoted to the construction of multi-dimensional schedules f o r a system of uniform recurrence equations. W e show that this problem is dual to the problem oj com-putability of a system of uniform recurrence equations. W e propose a new study of the decomposition algorithm j r s t proposed by Karp, Milliller and Winograd: we base our implementation on linear programming resolutio...
متن کاملA language - oriented approach to the design ofsystolic chips
The Alpha language results from research on automatic synthesis of systolic algorithms. It is based on the recurrence equation formalism introduced by Karp, Miller and Winograd in 1967. The basic objects of Alpha are variables indexed on integral points of a convex set. It is a functional/equational language, whose deenition is particularly well-suited to expressing regular algorithms, as well ...
متن کاملPerformance evaluation of multiple precision matrix multiplications using parallelized Strassen and Winograd algorithms
It is well known that Strassen and Winograd algorithms can reduce the computational costs associated with dense matrix multiplication. We have already shown that they are also very effective for software-based multiple precision floating-point arithmetic environments such as the MPFR/GMP library. In this paper, we show that we can obtain the same effectiveness for double-double (DD) and quadrup...
متن کاملLayouts for improved hierarchical parallel computations
New layouts for the assignment of a set of n parallel processors to perform certain tasks in several hierarchically connected layers are suggested, leading, after some initialization phase, to the full exploitation of all of the processing power all of the time. This framework is useful for a variety of string theoretic problems, ranging from modular arithmetic used, among others, in Karp-Rabin...
متن کاملImplementation of Rabin Karp String Matching Algorithm Using MPI
Searching for occurrences of string patterns is a common problem in many applications. One of the easiest approaches is to search a pattern in a text character by character. But this method becomes very slow when we deal with long patterns. Various good solutions like Naïve string Matcher, Knuth-Morris-Pratt (KMP), Rabin Karp (RK), etc have already been presented for string matching and we sele...
متن کامل